DHT ⊲ P 2 P Dictionary - Based Data Compression

Proceedings SWAT 88, First Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 318, pp. 176–189. Halmstad, Sweden (1988) 3. Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. Theor. Appl. 5, 143–154 (1995) 4. Blum, A., Raghavan, P., Schieber, B.: Navigating in Unfamiliar Geometric Terrain. In: On Line Algorithms, pp. 151–155, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence RI (1992) Preliminary Version in STOC 1991, pp. 494–504 5. Demaine, E., Fekete, S., Gal, S.: Online searching with turn cost. Theor. Comput. Sci. 361, 342–355 (2006) 6. Gal, S.: Minimax solutions for linear search problems. SIAM J. Appl. Math. 27, 17–30 (1974) 7. Gal, S.: Search Games, pp. 109–115, 137–151, 189–195. Academic Press, New York (1980) 8. Hipke, C., Icking, C., Klein, R., Langetepe, E.: How to Find a point on a linewithin a Fixed distance. Discret. Appl. Math. 93, 67–73 (1999) 9. Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63–79 (1996) Preliminary version in SODA ’93, pp. 441–447 10. Lopez-Ortiz, A.: On-Line Target Searching in Bounded and Unbounded Domains: Ph. D. Thesis, Technical Report CS-96-25, Dept. of Computer Sci., Univ. of Waterloo (1996) 11. Lopez-Ortiz, A., Schuierer, S.: The Ultimate Strategy to Search on m Rays? Theor. Comput. Sci. 261(2), 267–295 (2001) 12. Papadimitriou, C.H., Yannakakis, M.: Shortest Paths without aMap. Theor. Comput. Sci. 84, 127–150 (1991) Preliminary version in ICALP ’89 13. Schuierer, S.: Lower bounds in on-line geometric searching. Comput. Geom. 18, 37–53 (2001)